翻訳と辞書 Words near each other ・ Continuous tone ・ Continuous Tone-Coded Squelch System ・ Continuous track ・ Continuous training ・ Continuous transmission mode ・ Continuous truss bridge ・ Continuous wave ・ Continuous wavelet ・ Continuous wavelet transform ・ Continuous wound infiltration ・ Continuous-flow intersection ・ Continuous-flow manufacturing ・ Continuous-repayment mortgage ・ Continuous-rod warhead ・ Continuous-time Markov chain ・ Continuous-time quantum walk ・ Continuous-time random walk ・ Continuous-time stochastic process ・ Continuous-wave radar ・ Continuously compounded nominal and real returns ・ Continuously embedded ・ Continuously variable slope delta modulation ・ Continuously variable transmission ・ Continuum ・ Continuum (American Horror Story) ・ Continuum (Art Fair) ・ Continuum (chamber ensemble) ・ Continuum (design consultancy) ・ Continuum (John Mayer album) ・ Continuum (Ligeti) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Continuous-time quantum walk ： ウィキペディア英語版 Continuous-time quantum walk A Continuous-time quantum walk (CTQW) is a walk on a given connected graph that is dictated by a time-varying unitary matrix that relies on the Hamiltonian of the quantum system and the adjacency matrix. CTQW belongs to what is known as ''Quantum walks'', which also consists of the Discrete-time quantum walk. The concept of Continuous-time quantum walk is believed to have been first considered for quantum computation by Edward Farhi and Sam Gutmann.〔E. Farhi and S. Gutmann, ''Quantum computation and decision trees'', Phys. Rev. A 58, 915 (1998)〕 Though, it may be possible to consider CTQW for directed graphs, we focus on this area as it applies to undirected graphs unless stated otherwise. ==Introduction== Ever since the advent of quantum mechanics and the discovery by Shor of how to achieve factorization of large semi-primes efficiently (polynomial time) using quantum computation, scientists have been intrigued by the realm of possibilities. In many cases where the quantum algorithms are derived for problems, the complexity of the algorithms are faster than their classical counterpart. Some of these include Shor's factorization algorithm, which is exponentially faster than known classical factoring algorithms, and Grover's searching algorithms, which is polynomially faster than any possible black-box classical algorithm. Many of these algorithms use (or can be modified to use) the concept of ''quantum fourier transform''. In recent times, some scientists have decided to propose a new form of looking at quantum computation algorithms. The reason is that many classical algorithms are based on (classical) random walks. This led to the intuitive question of whether a "quantum random walk" (or simply "quantum walk") could be proposed. One such model of a quantum walk is the Continuous-time quantum walk (CTQW) proposed by E. Farhi et al.〔 There are a number of variations to representing a CTQW, but we follow the definition below. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Continuous-time quantum walk」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.